An Alternative Formulation of Cocke-Younger-Kasami's Algorithm
نویسنده
چکیده
− We provide a reformulation of Cocke−Younger−Kasami’s algorithm for recognizing context-free languages in which there are no references either to indices of table entries or to the length of the input string. Some top-down analogues of this functional approach are discussed as well.
منابع مشابه
A formalisation of the Cocke-Younger-Kasami algorithm
The theory provides a formalisation of the Cocke-Younger-Kasami algorithm [1] (CYK for short), an approach to solving the word problem for context-free languages. CYK decides if a word is in the languages generated by a context-free grammar in Chomsky normal form. The formalized algorithm is executable.
متن کاملThe Cocke-Younger-Kasami algorithm for cyclic strings
The chain-code representation of contours is widely used in syntactic shape recognition. However the ignorance of a starting point makes the time complexity of traditional parsers increase in one order. This paper describes a technique for adapting any Cock-Younger-Kasami context-free parser in order to use it with cyclic strings. The parsers obtained with this technique have the same time and ...
متن کاملInverting Dynamic Programming (meta 2012)
We suggest and discuss a formalization of Dynamic Programming. A methodological novelty consists in an explicit treatment (interpretation) of ascending Dynamic Programming as least fix-point computation (according to Knaster-Tarski fix-point theorem). This interpretation leads to a uniform approach to classical optimization problems as well as to problems where optimality is not explicit (Cocke...
متن کاملA Polynomial Algorithm for the Membership Problem with Categorial Grammars
This article presents an overview of a framework called categorial grammars from a theoretical and algorithmic perspective. It provides an introduction to the formalisms of these grammars and of the tools they use (the Lambek Calculus) for theoretical computer scientists who are not familiar with them. We give a clear presentation of the main classical and recent results on these grammars, espe...
متن کاملA dynamic programming approach to categorial deduction
We reduce the provability problem of any formula of the Lambek calculus to some context-free parsing problem. This reduction, which is based on non-commutative proof-net theory, allows us to derive an automatic categorial deduction algorithm akin to the well-known Cocke-Kasami-Younger parsing algorithm.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Bulletin of the EATCS
دوره 53 شماره
صفحات -
تاریخ انتشار 1994